Multi-objective Evolutionary Algorithms are Still Good: Maximizing Monotone Approximately Submodular Minus Modular Functions
نویسندگان
چکیده
منابع مشابه
Greed is Still Good: Maximizing Monotone Submodular+Supermodular Functions
We analyze the performance of the greedy algorithm, and also a discrete semi-gradient based algorithm, for maximizing the sum of a suBmodular and suPermodular (BP) function (both of which are non-negative monotone non-decreasing) under two types of constraints, either a cardinality constraint or p ≥ 1 matroid independence constraints. These problems occur naturally in several real-world applica...
متن کاملMaximizing Non-monotone/Non-submodular Functions by Multi-objective Evolutionary Algorithms
Evolutionary algorithms (EAs) are a kind of nature-inspired general-purpose optimization algorithm, and have shown empirically good performance in solving various real-word optimization problems. However, due to the highly randomized and complex behavior, the theoretical analysis of EAs is difficult and is an ongoing challenge, which has attracted a lot of research attentions. During the last t...
متن کاملMaximizing Submodular Functions under Matroid Constraints by Multi-objective Evolutionary Algorithms
Many combinatorial optimization problems have underlying goal functions that are submodular. The classical goal is to find a good solution for a given submodular function f under a given set of constraints. In this paper, we investigate the runtime of a multi-objective evolutionary algorithm called GSEMO until it has obtained a good approximation for submodular functions. For the case of monoto...
متن کاملMaximizing Stochastic Monotone Submodular Functions
We study the problem of maximizing a stochastic monotone submodular function with respect to a matroid constraint. Our model can capture the effect of uncertainty in different problems, such as cascade effects in social networks, capital budgeting, sensor placement, etc. We study the adaptivity gap the ratio between the values of optimal adaptive and non-adaptive policies and show that it is eq...
متن کاملMaximizing Submodular Functions under Matroid Constraints by Evolutionary Algorithms
Many combinatorial optimization problems have underlying goal functions that are submodular. The classical goal is to find a good solution for a given submodular function f under a given set of constraints. In this paper, we investigate the runtime of a simple single objective evolutionary algorithm called (1 + 1) EA and a multiobjective evolutionary algorithm called GSEMO until they have obtai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Evolutionary Computation
سال: 2020
ISSN: 1063-6560,1530-9304
DOI: 10.1162/evco_a_00288